A Fully Abstract Domain Model for the π-Calculus

نویسنده

  • Ian Stark
چکیده

Abramsky’s domain equation for bisimulation and the author’s categorical models for names combine to give a domain-theoretic model for the π-calculus. This is set in a functor category which provides a syntax-free interpretation of fresh names, privacy, visibility and non-interference between processes. The model is fully abstract for strong late bisimilarity and equivalence (bisimilarity under all name substitutions).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fully Abstract Model for the π - calculus

This paper provides both a fully abstract (domain-theoretic) model for the π -calculus and a universal (set-theoretic) model for the finite π -calculus with respect to strong late bisimulation and congruence. This is done by considering categorical models, defining a metalanguage for these models, and translating the π -calculus into the metalanguage. A technical novelty of our approach is an a...

متن کامل

Full Abstraction for Polymorphic Pi-Calculus

The problem of finding a fully abstract model for the polymorphic π-calculus was stated in Pierce and Sangiorgi’s work in 1997 and has remained open since then. In this paper, we show that a slight variant of their language has a direct fully abstract model, which does not depend on type unification or logical relations. This is the first fully abstract model for a polymorphic concurrent langua...

متن کامل

A Denotational Semantics for the π-Calculus

In his categorical framework, Stark defines a domain-theoretic model for the π-calculus based on functor categories. Despite being a sound abstract model, a more concrete semantics is required if it is to be used as a basis for proving properties about mobile systems. In this paper, we concretize Stark’s denotational model for the π-calculus and provide a full definition of the semantic domains...

متن کامل

Relationally Staged Computations in Calculi of Mobile Processes

We apply the recently developed techniques of higher order abstract syntax and functorial operational semantics to give a compositional and fully abstract semantics for the π-calculus equipped with open bisimulation. The key novelty in our work is the realisation that the sophistication of open bisimulation requires us to move from the usual semantic domain of presheaves over subcategories of S...

متن کامل

A fully abstract coalgebraic semantics for the pi-calculus under weak bisimilarity

Combining traces, coalgebra and lazy-filtering channel configurations for parallel composition, we give a fully-abstract denotational semantics for the π-calculus under weak early bisimilarity.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997